Imposing Hierarchy on a Graph
نویسندگان
چکیده
This paper investigates a way of imposing a hierarchy on a graph in order to explore relationships between elements of data. Imposing a hierarchy is equivalent to clustering. First a tree structure is imposed on the initial graph, then a k-partite structure is imposed on each previously obtained cluster. Imposing a tree exposes the hierarchical structure of the graph as well as providing an abstraction of the data. In this study three kinds of merge operations are considered and their composition is shown to yield a tree with a maximal number of vertices in which vertices in the tree are associated with disjoint connected subgraphs. These subgraphs are subsequently transformed into k-partite graphs using similar merge operations. These merges also ensure that the obtained tree is proper with respect to the hierarchy imposed on the data. A detailed example of the technique’s application in exposing the structure of protein interaction networks is described. The example focuses on the MAPK cell signalling pathway. The merge operations help expose where signal regulation occurs within the pathway and from other signalling pathways within the cell.
منابع مشابه
Morph: A (Shape) Polymorphic XML Query Language
ABSTRACT By imposing a single hierarchy on data, XML makes queries brittle in the sense that a query might fail to produce the desired result if it is executed on the same data organized in a different hierarchy, or if the hierarchy evolves during the lifetime of an application. This paper presents a new XML query language, called Morph, which supports more flexible querying. Morph is a shape p...
متن کاملAn Enriched UMLS Semantic Network with a Multiple Subsumption Hierarchy
Objective: The Unified Medical Language System’s (UMLS’s) Semantic Network’s (SN’s) two-tree structure is restrictive because it does not allow a semantic type to be a specialization of several other semantic types. In this paper, the SN is expanded into a multiple subsumption structure with a directed acyclic graph (DAG) IS-A hierarchy, allowing a semantic type to have multiple parents. New vi...
متن کاملCohen-Macaulay-ness in codimension for simplicial complexes and expansion functor
In this paper we show that expansion of a Buchsbaum simplicial complex is $CM_t$, for an optimal integer $tgeq 1$. Also, by imposing extra assumptions on a $CM_t$ simplicial complex, we provethat it can be obtained from a Buchsbaum complex.
متن کاملOn the Modularity of Deciding Call-by-Need
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple decidability proofs for a hierarchy of classes of rewrite systems that are much larger than earlier classes defined using the complicated sequentiality concept. In this paper we study the modularity of membership in ...
متن کاملBi-Hamiltonian Structure of Super KP Hierarchy
We obtain the bi-Hamiltonian structure of the super KP hierarchy based on the even super KP operator Λ = θ + ∑∞ i=−2 Uiθ , as a supersymmetric extension of the ordinary KP bi-Hamiltonian structure. It is expected to give rise to a universal super W -algebra incorporating all known extended superconformal WN algebras by reduction. We also construct the super BKP hierarchy by imposing a set of an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ECEASST
دوره 6 شماره
صفحات -
تاریخ انتشار 2007